A Matheuristic Approach Combining Local Search and Mathematical Programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Local Search Approach for Binary Programming: Feasibility Search

In this paper we propose a Local Search approach for NPHard problems expressed as binary programs. Our search method focuses on the fast production of feasible solutions. The method explicitly considers the structure of the problem as a conflict graph and uses a systematic neighbor generation procedure to jump from one feasible solution to another using chains of movements. Computational experi...

متن کامل

Combining Constraint Programming and Local Search for Job-Shop Scheduling

Since their introduction, local search algorithms have consistently represented the state-ofthe-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduli...

متن کامل

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

Local Search and Constraint Programming

LS techniques are based on a simple and general idea. Let P be the combinatorial optimization problem we want to solve, and s a current solution which, for the moment, we assume to be feasible for P , and to have value z(s). A neighborhood is defined for s with respect to a move type N , i.e., a function mapping s (actually, any feasible solution of P ) in a subset N (s) of the overall solution...

متن کامل

Combining Equity and Utilitarianism in a Mathematical Programming Model

We discuss the problem of combining the conflicting objectives of equity and utilitarianism, for social policy making, in a single mathematical programming model. The definition of equity we use is the Rawlsian one of maximising the minimum utility over individuals or classes of individuals. However, when the disparity of utility becomes too great, the objective becomes progressively utilitaria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Programming

سال: 2016

ISSN: 1058-9244,1875-919X

DOI: 10.1155/2016/1506084